Mapping state transition susceptibility in quantum annealing

Quantum annealing is a novel type of analog computation that aims to use quantum-mechanical fluctuations search for optimal solutions Ising problems. in the transverse field model, implemented on D-Wave devices, works by applying time-dependent field, which puts all qubits into uniform state superposition, and then Hamiltonian over time, describes user-programed problem. We present method utilizes two control features quantum annealers, namely reverse an $h$-gain schedule, quantify susceptibility, or distance, between classical states The starting encoded using annealing, second linear terms problem Hamiltonian. An schedule specified, incrementally increases strength terms, thus allowing quantification required transition anneal specific at final measurement. Because nature tends towards global minima, therefore we restrict minimum solution given This susceptibility mapping, when enumerated across initial states, shows detail behavior annealer during annealing. procedure experimentally demonstrated three small test models were embedded parallel Advantage_system4.1. Analysis mapping detailed characteristics process, including intermediate paths, are visually represented as networks.